How many carboxyl groups does an average molecule of humic-like substances contain?

How many carboxyl groups does an average molecule of humic - like substances contain ?

Optical properties of humic-like substances

Optical properties of humic-like substances (HULIS) in biomass-burning aerosols A. Hoffer, A. Gelencsér, P. Guyon, G. Kiss, O. Schmid, G. Frank, P. Artaxo, and M. O. Andreae Max Planck Institute for Chemistry, Department of Biogeochemistry, Mainz, Germany Air Chemistry Group of the Hungarian Academy of Sciences, Veszprém, Hungary Instituto de Fisica, Universidade de Sao Paulo, Sao Paulo, Brazil...

How Many Holes Can an Unbordered Partial Word Contain?

Partial words are sequences over a finite alphabet that may have some undefined positions, or “holes,” that are denoted by ’s. A nonempty partial word is called bordered if one of its proper prefixes is compatible with one of its suffixes (here is compatible with every letter in the alphabet); it is called unbordered otherwise. In this paper, we investigate the problem of computing the maximum ...

How many runs can a string contain?

Given a string x = x[1..n], a repetition of period p in x is a substring ur = x[i+1..i+rp], p = |u|, r ≥ 2, where neither u = x[i+1..i+p] nor x[i+1..i+(r+1)p+1] is a repetition. The maximum number of repetitions in any string x is well known to be Θ(n log n). A run or maximal periodicity of period p in x is a substring urt = x[i+1..i+rp+ |t|] of x, where ur is a repetition, t a proper prefix of...

How Many Squares Can a String Contain?

All our words (strings) are over a fixed alphabet. A square is a subword of the form uu=u, where u is a nonempty word. Two squares are distinct if they are of different shape, not just translates of each other. A word u is primitive if u cannot be written in the form u=v j for some j 2. A square u with u primitive is primitive rooted. Let M(n) denote the maximum number of distinct squares, P(n)...